Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform

نویسندگان

  • Xiaoyun Wang
  • Xianquan Zhang
چکیده

Point pattern matching is an important topic of computer vision and pattern recognition. In this paper, we propose a point pattern matching algorithm for two planar point sets under Euclidean transform.We view a point set as a complete graph, establish the relation between the point set and the complete graph, and solve the point pattern matching problem by finding congruent complete graphs. Experiments are conducted to show the effectiveness and robustness of the proposed algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Title : APPROXIMATION ALGORITHMS FOR POINT PATTERN MATCHING AND SEARCHING

Title : APPROXIMATION ALGORITHMS FOR POINT PATTERN MATCHING AND SEARCHING Minkyoung Cho, Doctor of Philosophy, 2010 Directed by: Professor David M. Mount Department of Computer Science Point pattern matching is a fundamental problem in computational geometry. For given a reference set and pattern set, the problem is to find a geometric transformation applied to the pattern set that minimizes so...

متن کامل

Research in Algorithms for Geometric Pattern Matching MIT 2001 - 06 Progress Report : July 1 , 2002 – December 31 , 2002 Piotr

As mentioned earlier, the focus of this project is to design a fast similarity search algorithm for large data sets of images. To evaluate the similarity between images, we use the Earth-Mover Metric (EMD). It was experimentally verified to capture well the perceptual notion of a difference between images, in fact much better than other wellknown metrics (e.g., Euclidean distance between the fe...

متن کامل

A Parallel Algorithm for Determining the Congruence of Point Sets in Three-Dimensions

This paper describes an O(log 3 n) time O(n= logn) processors parallel algorithm for determining the congruence (exact matching) of two point sets in three-dimensions on a CREW PRAM, where n is the maximum size of the input point sets. Although optimal O(n logn) time sequential algorithms were developed for this problem, no e cient parallel algorithm was known previously. In the algorithm, the ...

متن کامل

Research in Algorithms for Geometric Pattern Matching MIT 2001 - 06 Progress Report : January 1 , 2002 – June 30 , 2002

During the period of January-June 2002, the main focus of this project was implementing and evaluating algorithms for embedding Earth-Mover Distance into the Euclidean space. Earth-mover distance (EMD) is a recently proposed metric for computing distance between features of images (see [EMD] and references therein). It was experimentally verified to capture well the perceptual notion of a diffe...

متن کامل

A Direct Method for Estimating Planar Projective Transform

Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct registering two point sets in R using projective transform without using intensity values. In this very general context, there is no easily established correspondences that can be used to estimate the projective transform, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Applied Mathematics

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012